Optical zeno gate: bounds for fault tolerant operation
نویسندگان
چکیده
منابع مشابه
A Fault Tolerant Threshold Logic Gate Design
Threshold Logic gate is used as design abstraction for most nano devices and perceived as an alternate emerging technology to CMOS implementation. It is vulnerable to manufacturing inaccuracies that alter weight values which inadvertently affect the functionality of the gate. Hence fault tolerance should be taken in to consideration during the design of threshold logic gates to tolerate manufac...
متن کاملA Novel Fault Tolerant Reversible Gate For Nanotechnology Based Systems
This paper proposes a novel reversible logic gate, NFT. It is a parity preserving reversible logic gate, that is, the parity of the outputs matches that of the inputs. We demonstrate that the NFT gate can implement all Boolean functions. It renders a wide class of circuit faults readily detectable at the circuit’s outputs. The proposed parity preserving reversible gate, allows any fault that af...
متن کاملNew Fault-Tolerant Majority Gate for Quantum Dots Cellular Automata
In the high voltage (HV) electrical power systems, different materials are used as the role of insul ation to protect the incipient failure inside the HV power equipments. One of the common phenomenas in insulations is Partial Discharge (PD). Because of the high voltage stress, the weak section i nside the insulator causes the partial discharge (PD), which is known as a local electrical breakdo...
متن کاملFault-Tolerant Logical Gate Networks for CSS Codes
Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods which apply to codes of high rate, encoding k qubits per block with k > 1. It is shown that the logical qubits within a given block can be prepared by a single recovery operation in any state whose stabilizer generator separates into X and Z parts. Optimized methods to move logical qubits a...
متن کاملImproved Bounds for Minimum Fault-Tolerant Gossip Graphs
A k-fault-tolerant gossip graph is a (multiple) graph whose edges are linearly ordered such that for any ordered pair of vertices u and v, there are k + 1 edge-disjoint ascending paths from u to v. Let τ(n, k) denote the minimum number of edges in a k-fault-tolerant gossip graph with n vertices. In this paper, we present upper and lower bounds on τ(n, k) which improve the previously known bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2007
ISSN: 1367-2630
DOI: 10.1088/1367-2630/9/7/224